By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 33, Issue 4, pp. 783-1009

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Compaction, Retraction, and Constraint Satisfaction

Narayan Vikas

pp. 761-782

BibTeX  Abstract Full Text:  PDF

Strict Polynomial-Time in Simulation and Extraction

Boaz Barak and Yehuda Lindell

pp. 783-818

BibTeX  Abstract Full Text:  PDF

The Complexity of Three-Way Statistical Tables

Jesus De Loera and Shmuel Onn

pp. 819-836

BibTeX  Abstract Full Text:  PDF

On Multidimensional Packing Problems

Chandra Chekuri and Sanjeev Khanna

pp. 837-851

BibTeX  Abstract Full Text:  PDF

Counting Complexity of Solvable Black-Box Group Problems

N. V. Vinodchandran

pp. 852-869

BibTeX  Abstract Full Text:  PDF

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

Dariusz R. Kowalski and Andrzej Pelc

pp. 870-891

BibTeX  Abstract Full Text:  PDF

The Parameterized Complexity of Counting Problems

Jörg Flum and Martin Grohe

pp. 892-922

BibTeX  Abstract Full Text:  PDF

On Worst-Case Robin Hood Hashing

Luc Devroye, Pat Morin, and Alfredo Viola

pp. 923-936

BibTeX  Abstract Full Text:  PDF

Online Routing in Triangulations

Prosenjit Bose and Pat Morin

pp. 937-951

BibTeX  Abstract Full Text:  PDF

Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries

Werner Schachinger

pp. 952-983

BibTeX  Abstract Full Text:  PDF

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy

Jin-Yi Cai and Osamu Watanabe

pp. 984-1009

BibTeX  Abstract Full Text:  PDF